https://nova.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:12213 Wed 28 Mar 2018 14:34:22 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:17117 Wed 11 Apr 2018 14:48:45 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:4488 Wed 11 Apr 2018 12:54:05 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:26991 Wed 11 Apr 2018 11:44:28 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:31129 Tue 04 Feb 2020 10:56:06 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:43783 G we define k-labeling ρ such that the edges of G are labeled with integers {1,2,…,k_e} and the vertices of G are labeled with even integers {0,2,…,2k_v}, where k=max{k_e,2k_v}. The labeling ρ is called a vertex irregular reflexive k-labeling if distinct vertices have distinct weights, where the vertex weight is defined as the sum of the label of that vertex and the labels of all edges incident this vertex. The smallest k for which such labeling exists is called the reflexive vertex strength of G.]]> Thu 29 Sep 2022 13:48:03 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:8000 Sat 24 Mar 2018 08:42:34 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:8001 Sat 24 Mar 2018 08:42:34 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:9412 Sat 24 Mar 2018 08:39:32 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:7866 Sat 24 Mar 2018 08:38:57 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:8162 Sat 24 Mar 2018 08:36:06 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:7252 Sat 24 Mar 2018 08:33:50 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:11199 Sat 24 Mar 2018 08:13:36 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:10506 Sat 24 Mar 2018 08:08:28 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:6827 Sat 24 Mar 2018 07:45:42 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:28280 m,n is an example of join graphs and we give an antimagic labeling for K_m,n,n≥2m+1. In this paper we also provide constructions of antimagic labelings of some complete multipartite graphs.]]> Sat 24 Mar 2018 07:41:22 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:28279 f(H') = Σ_v∈(H') f(v)+Σ_e∈(H') f(e) form an arithmetic progression with the initial term a and the common difference d. When f(V) = {1, 2,...,⏐V⏐}, then G is said to be super (a, d)-H-antimagic. In this paper, we study super (a, d)-H-antimagic labellings of a disjoint union of graphs for d = ⏐E(H)⏐ - ⏐V(H)⏐.]]> Sat 24 Mar 2018 07:41:22 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:26506 Sat 24 Mar 2018 07:35:33 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:34916 antimagic labeling of G admitting an H-covering is a bijective function f : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} such that, for all subgraphs H' of G isomorphic to H, the H'-weights, et_f(H') = Σ_υ∈V(H')f(υ)+Σ_e∈E(H')F(e), constitute an arithmetic progression with the initial term a and the common difference d. Such a labeling is called super if f(V) = {1, 2, ..., ∣V∣}. In this paper, we study the existence of super (a, d)-H-antimagic labelings for graph operation G^H, where G is a (super) (b, d*)-edge-antimagic total graph and H is a connected graph of order at least 3.]]> Fri 06 Oct 2023 15:46:50 AEDT ]]>